Bayesian Tracking by Online Co-Training and Sequential Evolutionary Importance Resampling

نویسندگان

  • Lizuo Jin
  • Zhiguo Bian
  • Qinhan Xu
  • Zhengang Chen
چکیده

Object tracking is an indispensable ingredient of many machine vision applications such as intelligent visual surveillance, traffic monitoring, robot and vehicle navigation, human computer interactions, virtual and augmented realities, video compression and indexing, etc. and has drawn considerable attention from computer research communities in recent years. Actually, in the real world scenarios, that is a very challenging task due to the interference of noise, clutters, occlusions, illumination variations and dynamic changes of the object and the background appearance in the complex scene; a quite variety of tracking methods have been proposed to tackle these difficulties in decades (Yilmaz et al., 2006), which can be roughly divided into two categories: the deterministic method and the statistical methods. The deterministic method performs tracking typically by seeking the local extreme of a matching function which measures the similarity between a template and a candidate image; the most widely used similarity measures include the sum of squared differences, the histogram intersection distance, the Kullback-Leibler divergence, the normalized cross correlation coefficient, and the Bhattacharyya coefficient. Some optimization techniques have been proposed to search the local extreme of the matching function such as the meanshift method (Comaniciu et al., 2003) and the optical flow based method (Baker & Matthews, 2004). The drawback of these methods is if the matching function takes into account only the object and not the background, then it might not be able to correctly distinguish the object from the background and tracking might fail. More robust similarity measures are presented recently such as the posterior probability measure (Feng et al., 2008.) and the log likelihood ratio of features (Collins et al., 2005), which takes the background interference into account. Recently, object tracking is treated as a binary classification problem, where the object have to be identified from the background with multiple image cues and better performance over the matching function based approaches such as the template-matching method (Lucas & Kanade, 1981), the view-based method (Black & Jepson, 1998), and the kernel-based method (Comaniciu et al., 2003), etc. was reported in literatures, where a discriminative model for separating the object from the background is trained offline and applied before tracking and termed tracking-by-detection method (Andriluka et al., 2008 ; Avidan 2004; Breitenstein et al., 2009 ; Choudhury et al., 2003; Leibe et al., 2008; Okuma et al., 2004; Wu & Nevatia, 2007). However, to formulate that as an object-background discrimination problem, two important factors need to be treated carefully: what features to choose and how to train the classifiers. Furthermore, since the object and background appearance may change greatly

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Severe-Dynamic Tracking Problems Based on Lower Particles Resampling

For a target as it with large-dynamic-change which is still challenging for existing methods to perform robust tracking; the sampling-based Bayesian filtering often suffer from computational complexity associated with large number of particle demanded and weighing multiple hypotheses. Specifically, this work proposes a neural auxiliary Bayesian filtering scheme based on Monte Carlo resampling t...

متن کامل

Bayesian Non-Exhaustive Classification for Active Online Name Disambiguation

Œe name disambiguation task partitions a collection of records pertaining to a given name, such that there is a one-to-one correspondence between the partitions and a group of people, all sharing that given name. Most existing solutions for this task are proposed for static data. However, more realistic scenarios stipulate emergence of records in a streaming fashion where records may belong to ...

متن کامل

Online multiple people tracking-by-detection in crowded scenes

Multiple people detection and tracking is a challenging task in real-world crowded scenes. In this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. We have detected objects with deformable part models and a visual background extractor. In the tracking phase we have used a combination of support vector machine (SVM) person-specific classifie...

متن کامل

A New Modified Particle Filter With Application in Target Tracking

The particle filter (PF) is a novel technique that has sufficiently good estimation results for the nonlinear/non-Gaussian systems. However, PF is inconsistent that caused mainly by loss of particle diversity in resampling step and unknown a priori knowledge of the noise statistics. This paper introduces a new modified particle filter called adaptive unscented particle filter (AUPF) to overcome th...

متن کامل

Pruned Resampling: Probabilistic Model Selection Schemes for Sequential Face Recognition

This paper proposes probabilistic pruning techniques for a Bayesian video face recognition system. The system selects the most probable face model using model posterior distributions, which can be calculated using a Sequential Monte Carlo (SMC) method. A combination of two new pruning schemes at the resampling stage significantly boosts computational efficiency by comparison with the original o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012